Particle swarm optimization for minimizing total earliness/tardiness costs of two-stage assembly flowshop scheduling problem in a batched delivery system

نویسندگان

  • Amir Shojaie Islamic Azad university- Tehran south branch- School of industrial engineering-
  • Sina Sajedi Islamic Azad university- South Tehran Branch, Tehran-Iran
چکیده مقاله:

This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses scheduling a set of operation with specific due date in a batch delivery system. The aim is to minimize total weighted earliness/tardiness and delivery costs. As the problem is demonstrated to be NP-hard, a genetic algorithm (GA) and a particle swarm optimization (PSO) are presented to solve the problem in real scales. Number of problems are solved by them and the results are compared. The computational results illustrate that the proposed PSO has a qualifier performance than the GA.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

متن کامل

A Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...

متن کامل

An Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion

This paper deals with the m-machine permutation flowshop scheduling problem to minimize the total flowtime, an NP-complete problem, and proposes an improved particle swarm optimization (PSO) algorithm. To enhance the exploitation ability of PSO, a stochastic iterated local search is incorporated. To improve the exploration ability of PSO, a population update method is applied to replace non-pro...

متن کامل

Discrete Particle Swarm Optimization Algorithm for Flowshop Scheduling

In the context of manufacturing systems, scheduling refers to allocation of resources over time to perform a set of operations. Manufacturing systems scheduling has many applications ranging from manufacturing, computer processing, transportation, communication, health care, space exploration, education, distribution networks, etc. Scheduling is a process by which limited resources are allocate...

متن کامل

A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

متن کامل

A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem

In this paper we propose PSO–EDA, a hybrid particle swarm optimization (PSO) with estimation of distribution algorithm (EDA) to solve permutation flowshop scheduling problem (PFSP). PFSP is an NP-complete problem, for which PSO was recently applied. The social cognition in the metaphor of canonical PSO is incomplete, since information conveyed in the non-gbest particles is lost. Also, the intel...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 10  شماره special issue on scheduling

صفحات  78- 91

تاریخ انتشار 2017-12-21

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023